منابع مشابه
Finitary Coloring
Suppose that the vertices of Z are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex v is determined by a rule that examines the labels within a finite (but random and perhaps unbounded) distance R of v, and the same rule applies at all vertices. We investigate the tail behavior of R if the coloring is required ...
متن کاملOne-dependent Coloring by Finitary Factors
Holroyd and Liggett recently proved the existence of a stationary 1-dependent 4-coloring of the integers, the first stationary k-dependent q-coloring for any k and q. That proof specifies a consistent family of finite-dimensional distributions, but does not yield a probabilistic construction on the whole integer line. Here we prove that the process can be expressed as a finitary factor of an i....
متن کاملFinitary Languages
The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...
متن کاملFinitary Sketches
Finitary sketches, i.e., sketches with nite-limit and nite-colimit specii-cations, are proved to be as strong as geometric sketches, i.e., sketches with nite-limit and arbitrary colimit speciications. Categories sketchable by such sketches are fully characterized in the innnitary rst-order logic: they are axiomatizable by-coherent theories, i.e., basic theories using nite conjunctions, countabl...
متن کاملTopology coloring
The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in differe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2017
ISSN: 0091-1798
DOI: 10.1214/16-aop1127